On Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
Authors
Abstract:
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
similar resources
A Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
full textWaiting times of the Multiple Priority Dual Queue with Finite Buffer and Non- Preemptive Priority Scheduling
This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service ( ) QoS objectives for differenti...
full textA Preemptive Priority Queue as a Model with Server Vacations
We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/l queue with only non-priority customers arrivals, semi-Markovian service times and some server vacati...
full textA preemptive repeat priority queue with resampling: Performance analysis
In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing the system...
full textOptimal threshold policies in a two-class preemptive priority queue with admission and termination control
We consider a two-class M " A2 IMI'11 preemptive priority queue in which there are two essential on-line decisions that have to be taken. The first is the decision to either accept or reject new type-lor type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-lor type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of decis...
full textOptimal threshold policies in a two-class preemptive priority queue with admission and termination control
We consider a two-class M " A2 IMI'11 preemptive priority queue in which there are two essential on-line decisions that have to be taken. The first is the decision to either accept or reject new type-lor type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-lor type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of decis...
full textMy Resources
Journal title
volume 14 issue 1
pages 65- 68
publication date 2001-02-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023